525B - Pasha and String - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ar array
#define dbg(x) cerr << #x << "->" << x << endl
#define ld long double	
#define f first
#define sc second
#define endl '\n'
#define all(x) x.begin(), x.end()
#define lcm(x, y)(x * y) / (__gcd(x, y))
#define sz(t)(int)(t.size())

const int mod = 1e9 + 7;

void solve() {
	string s;
	int q; 
	cin >> s >> q;
	map<int, int> mp;
	for(int i = 0; i < q; ++i) {
		int x; cin >> x;
		mp[x] += 1;
	}
	int n = sz(s), pref = 0;
	for(int i = 0; i < n / 2; ++i) {
		if((mp[i + 1] + pref) % 2) swap(s[i], s[n - i - 1]);
		pref += mp[i + 1];
	}
	cout << s << endl;
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	
	int t=1; //cin >> t;
	while(t--) {
		solve();
	}
}